A mass formula for self-dual permutation codes

نویسنده

  • Annika Günther
چکیده

For a module V over a finite semisimple algebra A we give the total number of self-dual codes in V . This enables us to obtain a mass formula for self-dual codes in permutation representations of finite groups over finite fields of coprime characteristic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mass formula for various generalized weight enumerators of binary self-dual codes

In this paper we give extensions of the mass formula for biweight enumerators and the Jacobi weight enumerators of binary self-dual codes and binary doubly even self-dual codes. For binary doubly even self-dual codes, our formula is expressed in terms of the root system E8 embedded in C4 for biweight enumerators, while the root system D4 is employed for Jacobi weight enumerators. For self-dual ...

متن کامل

Mass Formula for Self - Orthogonal Codes over Z p 2 Dedicated to Professor D . K . Ray - Chaudhuri on the occasion of his 75 th birthday Rowena

In this note, we establish a mass formula for self-orthogonal codes over Z p 2 , where p is a prime. As a consequence, an alternative proof of the known mass formulas for self-dual codes over Z p 2 is obtained. We also establish a mass formula for even quaternary codes, which includes a mass formula for Type II quaternary codes as a special case.

متن کامل

Mass Formula for Self - Orthogonal Codes over Z p 2 December 23 , 2008 Dedicated to Professor D . K . Ray - Chaudhuri on the occasion of his 75 th birthday

In this note, we establish a mass formula for self-orthogonal codes over Zp2, where p is a prime. As a consequence, an alternative proof of the known mass formulas for self-dual codes over Zp2 is obtained. We also establish a mass formula for even quaternary codes, which includes a mass formula for Type II quaternary codes as a special case. On study leave from the Institute of Mathematics, Uni...

متن کامل

Constructive algorithm of self-dual error-correcting codes

In this paper, we consider self-dual codes over the finite ring Zps of integer modulo p for any prime p and for an integer s ≥ 4. We start with any self-dual code in lower modulo and give an necessary and sufficient condition for the self-duality of induced codes. Then we can give an inductive algorithm for construction of all self-dual codes and the mass formula in case of odd prime p.

متن کامل

On the existence of self-dual permutation codes of finite groups

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the other one is from the point of view of the Galois group of the coefficient field.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009